Enhancing the B+-tree by dynamic node popularity caching

We propose the Cache Coherent B-tree (CCB-tree), an indexing structure that can improve search performance compared to the traditional B-tree. The CCB-tree makes use of the unused space in the internal nodes of a B-tree to cache frequently queried leaf node addresses, thus saving node accesses. An experimental study shows that the CCB-tree can outperform the traditional B-tree on workloads where certain queries are much more popular than the others.